String adjunct grammars: I. Local and distributed adjunction
نویسندگان
چکیده
منابع مشابه
Order and Optionality: Minimalist Grammars with Adjunction
Adjuncts are characteristically optional, but many, such as adverbs and adjectives, are strictly ordered. In Minimalist Grammars (MGs), it is straightforward to account for optionality or ordering, but not both. I present an extension of MGs, MGs with Adjunction, which accounts for optionality and ordering simply by keeping track of two pieces of information at once: the original category of th...
متن کاملModels of Adjunction in Minimalist Grammars
Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational level. Weak generative capacity is not affected, and while subregular complexity varies bet...
متن کاملOn the Treatment of Scrambling and Adjunction in Minimalist Grammars
1 Introduction Stabler (2001:258) suggested that ""asymmetric" feature checking" is among the mechanisms that "remain to be carefully explored" within his "minimalist grammars" framework. Our presentation will undertake exactly this kind of exploration. Concretely, we are going to extend the "minimalist grammars" framework of Stabler (1997) (see also Harkema 2001; Michaelis 2001) by adding the ...
متن کاملSimilarities Between String Grammars and Graph Grammars
In this paper, we present some studies about relations existing between well known Chomsky string grammars and graph grammars, in particularly hypergraph grammars. We are discussing about deterministic context free Lindenmayer Systems used to describe commands to a device that generates black and white digital images. Instead of well-known methods of drawing, we will paint squares, not lines. A...
متن کاملParsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of these grammars, string languages like anbncn can be modeled that can not be generated by context-free grammars for strings. They are well suited to model discontinuous constituents in natural languages, i.e. constitu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1972
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(72)90051-4